Deterministic propositional dynamic logic: Finite models, complexity, and completeness

Deterministic Propositional Dynamic Logic: Finite Models, Complexity, and Completeness

Let p be a formula in deterministic propositional dynamic logic. A decision procedure for the satisliability of p is given along with a construction of a finite model for every satisfiable p. The decision procedure runs in deterministic time 2’” and the size of the model is bounded by nz . 4”, where n is the length of p. Finally, a complete axiomatization for deterministic propositional dynamic...

On the Completeness of Propositional Hoare Logic

As shown by Cook [5], Hoare logic is relatively complete for partial correctness assertions (PCAs) over while programs whenever the underlying assertion language is sufficiently expressive. The expressiveness conditions in Cook’s formulation provide for the expression of weakest preconditions. These conditions holds for first-order logic over , for example, because of the coding power of first-...

The completeness of Stoic propositional logic

A Lower Complexity Bound for Propositional Dynamic Logic with Intersection

This paper shows that satisfiability for Propositional Dynamic Logic with Intersection is EXPSPACE-hard. The proof uses a reduction from the word problem for alternating, exponential time bounded Turing Machines.

Generalizing Propositional Dynamic Logic

A new semantics of Propositional Dynamic Logic (PDL) is given in terms of predicate transformers: Instead of associating the standard state transformer with each program, we model programs by operations on sets of states, operations which map postconditions to weakest liberal preconditions. This yields a logic more general than PDL since new program operations such as angelic choice become expr...